Geometric Clustering to Minimize the Sum of Cluster Sizes
نویسندگان
چکیده
We study geometric versions of the min-size k-clustering problem, a clustering problem which generalizes clustering to minimize the sum of cluster radii and has important applications. We prove that the problem can be solved in polynomial time when the points to be clustered are located on a line. For Euclidean spaces of higher dimensions, we show that the problem is NP-hard and present polynomial time approximation schemes. The latter result yields an improved approximation algorithm for the related problem of k-clustering to minimize the sum of cluster diameters.
منابع مشابه
Range-Clustering Queries
In a geometric k-clustering problem the goal is to partition a set of points in R into k subsets such that a certain cost function of the clustering is minimized. We present data structures for orthogonal range-clustering queries on a point set S: given a query box Q and an integer k > 2, compute an optimal k-clustering for S ∩Q. We obtain the following results. – We present a general method to...
متن کاملGeometric clustering in normed planes
Given two sets of points A and B in a normed plane, we prove that there are two linearly separable sets A′ and B′ such that diam(A′) ≤ diam(A), diam(B′) ≤ diam(B), and A′ ∪B′ = A ∪B. This extends a result for the Euclidean distance to symmetric convex distance functions. As a consequence, some Euclidean k-clustering algorithms are adapted to normed planes, for instance, those that minimize the ...
متن کاملA survey on exact methods for minimum sum-of-squares clustering
Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of n entities into k clusters in order to minimize the sum of squared distances from the entities to the centroid of their cluster. Among many criteria used for cluster analysis, the minimum sum-of-squares is one of the most popular since it expresses both homogeneity and separation. A mathematical programming formula...
متن کاملDynamic Clustering to Minimize the Sum of Radii
In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sumof-radii cluste...
متن کاملWorking Paper Alfred P. Sloan School of Management Using the K-means Clustering Method as a Density Estii-lation Procedure Using the K-means Clustering Method as a Density Estimtion Procedure
A random sample of size N is divided into k clusters that minimize the within cluster sum of squares locally. This k-means clustering method can be used as a quick procedure for constructing variable-cell historgrams that have no empty cell. A histogram estimate is proposed in this paper, and is shown to be uniformly consistent in probability.
متن کامل